Connectivity at infinity for right angled Artin groups

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connectivity at Infinity for Right Angled Artin Groups

We establish sufficient conditions implying semistability and connectivity at infinity properties for CAT(0) cubical complexes. We use this, along with the geometry of cubical K(π, 1)’s to give a complete description of the higher connectivity at infinity properties of right angled Artin groups. Among other things, this determines which right angled Artin groups are duality groups. Applications...

متن کامل

Pushing fillings in right-angled Artin groups

We define a family of quasi-isometry invariants of groups called higher divergence functions, which measure isoperimetric properties “at infinity.” We give sharp upper and lower bounds on the divergence functions for right-angled Artin groups, using different pushing maps on the associated cube complexes. In the process, we define a class of RAAGs we call orthoplex groups, which have the proper...

متن کامل

Surface Subgroups of Right-Angled Artin Groups

We consider the question of which right-angled Artin groups contain closed hyperbolic surface subgroups. It is known that a right-angled Artin group A(K) has such a subgroup if its defining graph K contains an n-hole (i.e. an induced cycle of length n) with n ≥ 5. We construct another eight “forbidden” graphs and show that every graph K on ≤ 8 vertices either contains one of our examples, or co...

متن کامل

Right-angled Artin Groups and Their Subgroups

These are notes for a course offered at Yale University in the spring semester of 2013.

متن کامل

Topology of Random Right Angled Artin Groups

In this paper we study topological invariants of a class of random groups. Namely, we study right angled Artin groups associated to random graphs and investigate their Betti numbers, cohomological dimension and topological complexity. The latter is a numerical homotopy invariant reflecting complexity of motion planning algorithms in robotics. We show that the topological complexity of a random ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 2000

ISSN: 0002-9947,1088-6850

DOI: 10.1090/s0002-9947-00-02506-x